Proximal quasi-normal structure in convex metric spaces
نویسنده
چکیده
We consider, in the setting of convex metric spaces, a new class of Kannan type cyclic orbital contractions, and study the existence of its best proximity points. The same problem is then discussed for relatively Kannan nonexpansive mappings, by using the concept of proximal quasinormal structure. In this way, we extend the main results in Abkar and Gabeleh [A. Abkar and M. Gabeleh, J. Nonlin. Convex Anal. 14 (2013), 653-659].
منابع مشابه
Composition of resolvents and quasi-nonexpansive multivalued mappings in Hadamared spaces
The proximal point algorithm, which is a well-known tool for finding minima of convex functions, is generalized from the classical Hilbert space framework into a nonlinear setting, namely, geodesic metric spaces of nonpositive curvature. In this paper we propose an iterative algorithm for finding the common element of the minimizers of a finite family of convex functions a...
متن کاملCoincidence Quasi-Best Proximity Points for Quasi-Cyclic-Noncyclic Mappings in Convex Metric Spaces
We introduce the notion of quasi-cyclic-noncyclic pair and its relevant new notion of coincidence quasi-best proximity points in a convex metric space. In this way we generalize the notion of coincidence-best proximity point already introduced by M. Gabeleh et al cite{Gabeleh}. It turns out that under some circumstances this new class of mappings contains the class of cyclic-noncyclic mappings ...
متن کاملW-convergence of the proximal point algorithm in complete CAT(0) metric spaces
In this paper, we generalize the proximal point algorithm to complete CAT(0) spaces and show that the sequence generated by the proximal point algorithm $w$-converges to a zero of the maximal monotone operator. Also, we prove that if $f: Xrightarrow ]-infty, +infty]$ is a proper, convex and lower semicontinuous function on the complete CAT(0) space $X$, then the proximal...
متن کاملNew best proximity point results in G-metric space
Best approximation results provide an approximate solution to the fixed point equation $Tx=x$, when the non-self mapping $T$ has no fixed point. In particular, a well-known best approximation theorem, due to Fan cite{5}, asserts that if $K$ is a nonempty compact convex subset of a Hausdorff locally convex topological vector space $E$ and $T:Krightarrow E$ is a continuous mapping, then there exi...
متن کاملProximal Point Algorithm for Quasi-convex Minimization Problems in Metric Spaces
In this paper, the proximal point algorithm for quasi-convex minimization problem in nonpositive curvature metric spaces is studied. We prove ∆-convergence of the generated sequence to a critical point (which is defined in the text) of an objective convex, proper and lower semicontinuous function with at least a minimum point as well as some strong convergence results to a minimum point with so...
متن کامل